Quasi Entailment Mesh
نویسندگان
چکیده
One outcome of the fourth in a series of Workshops on Reflection (as an approach to research), the production of a jointly authored subject matter, is discussed in terms of both Pask’s Entailment Meshes, and Schön’s Reflective Practice. A modification of Pask’s specification is proposed for the process of exploring an incomplete subject matter and in progress authoring of an Entailment Mesh, which we call a Quasi Entailment Mesh. The differences are presented and validated. An electronic translation of this Quasi Entailment Mesh is introduced, with indications of further potential uses.
منابع مشابه
Probabilistic entailment in the setting of coherence: The role of quasi conjunction and inclusion relation
In this paper, by adopting a coherence-based probabilistic approach to default reasoning, we focus the study on the logical operation of quasi conjunction and the Goodman-Nguyen inclusion relation for conditional events. We recall that quasi conjunction is a basic notion for defining consistency of conditional knowledge bases. By deepening some results given in a previous paper we show that, gi...
متن کاملQuasi Conjunction and Inclusion Relation in Probabilistic Default Reasoning
We study in the setting of probabilistic default reasoning under coherence the quasi conjunction, which is a basic notion for defining consistency of conditional knowledge bases, and the Goodman & Nguyen inclusion relation for conditional events. We deepen two results given in a previous paper: the first result concerns p-entailment from a finite family F of conditional events to the quasi conj...
متن کاملThe Beauty and the Beast Algorithm: Quasi-Linear Incremental Tests of Entailment and Disentailment over Trees
We consider the problem of the simultaneous tests of matching and non-unifiability (logically: entailment and disentailment over trees) where the input consists of one fixed term (one fixed constraint) and an incrementally growing set of variable bindings (the constraint store). These tests are used in logic programming systems with suspensions, e.g. for proving guards as in LIFE, AKL and Oz. A...
متن کاملBootstrapping knowledge representations: from entailment meshes via semantic nets to learning webs
The symbol-based, correspondence epistemology used in AI is contrasted with the constructivist, coherence epistemology promoted by cybernetics. The latter leads to bootstrapping knowledge representations, in which different parts of the cognitive system mutually support each other. Gordon Pask's entailment meshes and their implementation in the THOUGHTSTICKER program are reviewed as a basic app...
متن کاملOrdering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
The system FT of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate decidability and complexity questions for fragments of the first-order theory of FT . It is well-known that the first-order theory of FT is decidable and that several of its fragments can be decided in quasi-linear time, includi...
متن کامل